Parallel Hybrid Sparse Solvers Through Flexible Incomplete Cholesky Preconditioning
نویسندگان
چکیده
We consider parallel preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) for sparse linear system solution. We develop methods for constructing and applying preconditioners on multiprocessors using incomplete factorizations with selective inversion for improved latency-tolerance. We provide empirical results on the efficiency, scalability and quality of our preconditioners for sparse matrices from model grids and some problems from practical applications. Our results indicate that our preconditioners enable more robust sparse linear system solution.
منابع مشابه
A Hybrid Parallel Preconditioner Using Incomplete Cholesky Factorization and Sparse Approximate Inversion
We have recently developed a preconditioning scheme that can be viewed as a hybrid of incomplete factorization and sparse approximate inversion methods. This hybrid scheme attempts to deliver the strengths of both types of preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) on multiprocessors. We provide an overview of our algorithm and report on initial results fo...
متن کاملPerformance of Parallel Conjugate Gradient Solvers in Meshfree Analysis
Meshfree analysis methods, on a per degree of freedom basis, are typically more computationally expensive and yet more accurate than finite element methods. For very large models, whether meshfree or finite element, the memory and computational effort associated with direct equation solvers makes them prohibitively expensive. In this work, the performance of different linear equation solvers wi...
متن کاملParallel Preconditioning Techniques for Sparse CG Solvers
Conjugate gradient (CG) methods to solve sparse systems of linear equations play an important role in numerical methods for solving discretized partial diierential equations. The large size and the condition of many technical or physical applications in this area result in the need for eecient par-allelization and preconditioning techniques of the CG method. In particular for very ill-condition...
متن کاملComparative Analysis of High Performance Solvers for 3D Elliptic Problems
The presented comparative analysis concerns two iterative solvers for 3D linear boundary value problems of elliptic type. After applying the Finite Difference Method (FDM) or the Finite Element Method (FEM) discretization a system of linear algebraic equations has to be solved, where the stiffness matrix is large, sparse and symmetric positive definite. It is well known that the preconditioned ...
متن کاملParallel Multigrid Preconditioning of the Conjugate Gradient Method for Systems of Subsurface Hydrology
Parallel preconditioners are considered for improving the convergence rate of the conjugate gradient method for solving sparse symmetric positive deenite systems generated by nite element models of subsurface ow. The diiculties of adapting eeective sequential preconditioners to the parallel environment are illustrated by our treatment of incomplete Cholesky preconditioning. These diiculties are...
متن کامل